The capacity region of general multiple-access channel with certain correlated sources

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Multiple Access Channel with Correlated Sources and Cribbing Encoders

A discrete memoryless multiple access channel (MAC) is a quadruple { X1,X2, PY |X1,X2 ,Y } where X1,X2 are the input alphabets, Y the output alphabet, and PY |X1,X2 a transition probability matrix from X1 × X2 to Y . For shorthand notation, we will refer to the MAC by PY |X1,X2 . A source pair is a triplet {U ,V, PU,V } where PU,V is a distribution on U × V . We use the following notation: rand...

متن کامل

On the Capacity Region of Multiple Access Channel

The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.

متن کامل

On the Capacity Region of Multiple Access Adder Channel

The model of communication is as follows (see Fig. 1). Each user i chooses a label mi uniformly from its message set [Mi] and sends the codeword ei(mi). All the users send their codewords simultaneously, symbol by symbol. After n transmissions, a sequence of n output symbols (y1, y2, . . . , yn) is received according to the transition probability matrix. This is then decoded by the decoding fun...

متن کامل

Multiple access channels with arbitrarily correlated sources

Manuscript received November 28, 1978; revised February 28, 1980. This work was supported in part by the National Science Foundation under Grant ENG 76-23334, in part by the Stanford Research Institute under International Contract D/&C-15-C-0187, and in part by the Joint Scientific Enaineerina Program under Contracts NO001475-C-0601 and F44620-76-C&01. This paper was presented at the 1979 IEEE ...

متن کامل

A General Achievable Rate Region for Multiple-Access Relay Channels and Some Certain Capacity Theorems

In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our general rate region (i) generalizes the achievability part of Slepian-Wolf multiple-access capacity theorem to the MARC, (ii) extends the Cover-El Gamal best achi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1979

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(79)90337-1